A probabilistic algorithm for computing minimum weights of large error-correcting codes

Given a binary nonlinear code, we provide a deterministic algorithm to to use probabilistic algorithms for the computation of the minimum distance, such as the there are algorithms which perform much better than brute force, e.g. code with large minimum distance and the minimum weight, of any random binary code. code C over Fq of length n and dimension k capable of correction w errors. A matrix columns that is error-free and where the submatrix composed by this subset is A Probabilistic Algorithm for Computing Minimum Weights of Large.